package homework.day27;

public class Prob1 {

	public static void main(String[] args) {

		int limit = 100;

		Util util = new Util();

		int primeCount = util.findPrimeCount(limit);
		System.out.println("1~" + limit + "±îÁöÀÇ  ¼Ò¼öÀÇ  °³¼ö´Â : " + primeCount + "EAÀÌ¸ç ¼Ò¼ö´Â ¾Æ·¡¿Í °°´Ù.");

		System.out.println("///////////////////////////////////////////////////////////////");

		int[] primeArray = util.findPrimeReturnArray(limit);
		util.findPrimeReturnArray(limit);

		for(int i=0; i<primeArray.length; i++) {
			System.out.print(primeArray[i] + ((primeArray.length-1)!=i ? "," : ""));
         //ㅁㅁㅁㅁㅁㅁㅁㅁㅁㅁㅁㅁㅁㅁㅁㅁㅁㅁㅁ
		}
	}
}
